On fairness in the carpool problem
نویسنده
چکیده
We discuss the carpool problem, where one has to assign drivers to subsets of participants who commute regularly. Fagin and Williams defined a notion of fair share for participants (the FW share). We provide an axiomatic characterization of the fair share and show that the FW share is the unique one satisfying these requirements. We define a coalitional game where the Shapley value is the FW share.
منابع مشابه
The Offline Carpool Problem Revisited
The carpool problem is to schedule for every time t ∈ N l tasks taken from the set [n] (n ≥ 2). Each task i has a weight wi(t) ≥ 0, where ∑n i=1 wi(t) = l. We let ci(t) ∈ {0, 1} be 1 iff task i is scheduled at time t, where (carpool condition) wi(t) = 0 ⇒ ci(t) = 0. The carpool problem exists in the literature for l = 1, with a goal to make the schedule fair, by bounding the absolute value of E...
متن کاملFairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In
9 For the case of a randomized algorithm, we should rst be convinced that the adversary's power is no stronger than that of an oblivious adversary in each of the carpool instances that we have deened. Observe that the inputs to the j instance are determined by (V 1 ; V 2 ; : : :) and the decisions made by the carpool solver on instances j + 1 through`. The decisions made in instance k, for 1 k ...
متن کاملA New Model for a Carpool Matching Service
Carpooling is an effective means of reducing traffic. A carpool team shares a vehicle for their commute, which reduces the number of vehicles on the road during rush hour periods. Carpooling is officially sanctioned by most governments, and is supported by the construction of high-occupancy vehicle lanes. A number of carpooling services have been designed in order to match commuters into carpoo...
متن کاملApproximation Algorithms for the Maximum Carpool Matching Problem
The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V,A), a capacity function c : V → N, and a weight function w : A→ R, a feasible carpool matching is a triple (P,D,M), where P (passengers) and D (drivers) form a partition of V , and M is a subset of A∩ (P ×D), under the constraints that for every vertex d ∈ D, deg in(d) ≤ c(...
متن کاملLocal Search Algorithms for the Maximum Carpool Matching Problem
The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V,A), a capacity function c : V → N, and a weight function w : A → R+, a carpool matching is a subset of arcs, M ⊆ A, such that every v ∈ V satisfies: (i) din M (v) · dout M (v) = 0, (ii) din M (v) ≤ c(v), and (iii) dout M (v) ≤ 1. A vertex v for which dout M (v) = 1 is a pas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 55 شماره
صفحات -
تاریخ انتشار 2005